M-Order generalized Frobenius partitions with M colors
نویسندگان
چکیده
منابع مشابه
Congruences for Generalized Frobenius Partitions with an Arbitrarily Large Number of Colors
In his 1984 AMS Memoir, George Andrews defined the family of k–colored generalized Frobenius partition functions. These are enumerated by cφk(n) where k ≥ 1 is the number of colors in question. In that Memoir, Andrews proved (among many other things) that, for all n ≥ 0, cφ2(5n+3) ≡ 0 (mod 5). Soon after, many authors proved congruence properties for various k–colored generalized Frobenius part...
متن کاملm-ary partitions with no gaps: A characterization modulo m
In a recent work, the authors provided the first-ever characterization of the values bm(n) modulo m where bm(n) is the number of (unrestricted) m-ary partitions of the integer n and m ≥ 2 is a fixed integer. That characterization proved to be quite elegant and relied only on the base m representation of n. Since then, the authors have been motivated to consider a specific restricted m-ary parti...
متن کاملM m m Queue with Balking, Reneging and Additional Servers
In this paper, we consider a multi-server queuing system in which additional servers are allowed for a longer queue to reduce the customer’s balking and reneging behavior. The customers are assumed to arrive in Poisson fashion and their service- times follow exponential distribution. The number of servers in long run depends on the queue-length. We obtain equilibrium queue size distribution. Th...
متن کاملEnumeration of M-partitions
An M-partition of a positive integer m is a partition of m with as few parts as possible such that every positive integer less than m can be written as a sum of parts taken from the partition. This type of partition is a variation of MacMahon’s perfect partition, and was recently introduced and studied by O’Shea, who showed that for half the numbers m, the number of M-partitions of m is equal t...
متن کاملBeaded partitions with k colors
In this paper a new category of partitions called beaded partitions with k colors will be introduced. The generating functions for these partitions will be given and several properties and congruences will be presented. A beaded partition of a positive integer n is a necklace made up of strands of beads in k colors where the total number of beads in the necklace is n. Sliding the beads around t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 1991
ISSN: 0022-314X
DOI: 10.1016/0022-314x(91)90050-l